Optimal detection of query injectivity

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Continuity and Injectivity of Optimal Maps

Figalli–Kim–McCann proved in [14] the continuity and injectivity of optimal maps under the assumption (B3) of nonnegative cross-curvature. In the recent [15, 16], they extend their results to the assumption (A3w) of Trudinger-Wang [34], and they prove, moreover, the Hölder continuity of these maps. We give here an alternative and independent proof of the extension to (A3w) of the continuity and...

متن کامل

Hölder continuity and injectivity of optimal maps∗

Consider transportation of one distribution of mass onto another, chosen to optimize the total expected cost, where cost per unit mass transported from x to y is given by a smooth function c(x, y). If the source density f(x) is bounded away from zero and infinity in an open region U ′ ⊂ R, and the target density f−(y) is bounded away from zero and infinity on its support V ⊂ R, which is strongl...

متن کامل

Some Comments on Injectivity and P-injectivity

A generalization of injective modules (noted GI-modules), distinct from p-injective modules, is introduced. Rings whose p-injective modules are GI are characterized. If M is a left GI-module, E = End(AM), then E/J(E) is von Neumann regular, where J(E) is the Jacobson radical of the ring E. A is semisimple Artinian if, and only if, every left A-module is GI. If A is a left p. p., left GI-ring su...

متن کامل

Optimal Divide and Query

Algorithmic debugging is a semi-automatic debugging technique that allows the programmer to precisely identify the location of bugs without the need to inspect the source code. The technique has been successfully adapted to all paradigms and mature implementations have been released for languages such as Haskell, Prolog or Java. During three decades, the algorithm introduced by Shapiro and late...

متن کامل

The Optimal-Location Query

We propose and solve the optimal-location query in spatial databases. Given a set S of sites, a set O of weighted objects, and a spatial region Q, the optimal-location query returns a location in Q with maximum influence. Here the influence of a location l is the total weight of its RNNs, i.e. the total weight of objects in O that are closer to l than to any site in S. This new query has practi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: DAIMI Report Series

سال: 2002

ISSN: 2245-9316,0105-8517

DOI: 10.7146/dpb.v19i311.6702